1

Stable routing under the Spanning Tree Protocol

Year:
2010
Language:
english
File:
PDF, 404 KB
english, 2010
3

Refined memorization for vertex cover

Year:
2005
Language:
english
File:
PDF, 129 KB
english, 2005
4

On the complexity of fixed parameter clique and dominating set

Year:
2004
Language:
english
File:
PDF, 226 KB
english, 2004
5

Solving Connected Dominating Set Faster than 2n

Year:
2008
Language:
english
File:
PDF, 371 KB
english, 2008
21

Designing reliable algorithms in unreliable memories

Year:
2007
Language:
english
File:
PDF, 602 KB
english, 2007
22

Balanced cut approximation in random geometric graphs

Year:
2009
Language:
english
File:
PDF, 504 KB
english, 2009
23

Detecting directed 4-cycles still faster

Year:
2003
Language:
english
File:
PDF, 59 KB
english, 2003
28

A linear time algorithm to list the minimal separators of chordal graphs

Year:
2006
Language:
english
File:
PDF, 193 KB
english, 2006
30

A note on the complexity of minimum dominating set

Year:
2006
Language:
english
File:
PDF, 92 KB
english, 2006
33

A Theory of Diagnosability of Digital Systems

Year:
1976
Language:
english
File:
PDF, 2.88 MB
english, 1976
39

New approaches to multi-objective optimization

Year:
2014
Language:
english
File:
PDF, 975 KB
english, 2014
50

A measure & conquer approach for the analysis of exact algorithms

Year:
2009
Language:
english
File:
PDF, 668 KB
english, 2009